#include<bits/stdc++.h>
using namespace std;
int n;
int cnt;
int r[200010],a[200010];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>r[i];
    sort(r+1,r+n+1);//ok
    cnt=r[1];
    int y=0;
    for(int i=2;i<=n;i++){
        if(cnt!=r[i]){
            y++;
            a[y]=r[i];
        }
    }
    int i=1,j=1;
    while(j<=y){
        if(r[i]<a[j]){
            i++;
            j++;
            n--;
        } else{
            j++;
        }
    }
    cout<<n;


    return 0;
}
